|
Paul Zimmermann (born November 13, 1964) is a French computational mathematician, working at INRIA. His interests include asymptotically fast arithmetic—he wrote a book〔(【引用サイトリンク】title=Modern Computer Arithmetic )〕 on algorithms for computer arithmetic with Richard Brent. He has developed some of the fastest available code for manipulating polynomials over GF(2), and for calculating hypergeometric constants to billions of decimal places. He is associated with the CARAMEL project to develop efficient arithmetic, in a general context and in particular in the context of algebraic curves of small genus; arithmetic on polynomials of very large degree turns out to be useful in algorithms for point-counting on such curves. He is also interested in computational number theory. In particular, he has contributed to some of the record computations in integer factorisation 〔(Cryptology ePrint Archive: Report 2010/006 )〕 and discrete logarithm.〔(Cryptology ePrint Archive: Report 2013/197 )〕 He has been an active developer of the GMP-ECM implementation of the elliptic curve method for integer factorisation and of MPFR, an arbitrary precision floating point library with correct rounding. In a 2014 blog post,〔(【引用サイトリンク】title=Why I refuse to review papers submitted to open-access and hybrid journals? )〕 Zimmerman said that he would refuse invitations to review papers submitted to gold (author-pays) open access and hybrid open access journals, because he disagrees with the publication mechanism. == References == 〔 * 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Paul Zimmermann」の詳細全文を読む スポンサード リンク
|